Ultrafast Holonomic Quantum Gates

Robust gates for holonomic quantum computation

Giuseppe Florio, 2 Paolo Facchi, 2 Rosario Fazio, 5 Vittorio Giovannetti, and Saverio Pascazio Dipartimento di Fisica, Università di Bari, I-70126 Bari, Italy INFN, Sezione di Bari, I-70126 Bari, Italy Dipartimento di Matematica, Università di Bari, I-70125 Bari, Italy NEST CNR-INFM & Scuola Normale Superiore, Piazza dei Cavalieri 7, 56126 Pisa, Italy International School for Advanced Studies (...

Exact solutions for universal holonomic quantum gates

We show how one can implement any local quantum gate on specific qubits in an array of qubits by carrying adiabatically a Hamiltonian around a closed loop. We find the exact form of the loop and the Hamiltonian for implementing general one and two qubits gates. Our method is analytical and is not based on numerical search in the space of all loops. email:[email protected] email:[email protected]...

Realization of arbitrary gates in holonomic quantum computation

Among the many proposals for the realization of a quantum computer, holonomic quantum computation is distinguished from the rest as it is geometrical in nature and thus expected to be robust against decoherence. Here we analyze the realization of various quantum gates by solving the inverse problem: Given a unitary matrix, we develop a formalism by which we find loops in the parameter space gen...

Optical holonomic single quantum gates with a geometric spin under a zero field

Holonomic quantum computation

We show that the notion of generalized Berry phase i.e., non-abelian holonomy, can be used for enabling quantum computation. The computational space is realized by a n-fold degenerate eigenspace of a family of Hamiltonians parametrized by a manifold M. The point of M represents classical configuration of control fields and, for multi-partite systems, couplings between subsystem. Adiabatic loops...